Mathematical programming for piecewise linear regression analysis
نویسندگان
چکیده
منابع مشابه
A Mathematical Modeling for Plastic Analysis of Planar Frames by Linear Programming and Genetic Algorithm
In this paper, a mathematical modeling is developed for plastic analysis of planar frames. To this end, the researcher tried to design an optimization model in linear format in order to solve large scale samples. The computational result of CPU time requirement is shown for different samples to prove efficiency of this method for large scale models. The fundamental concept of this model is ob...
متن کاملA Learning Algorithm for Piecewise Linear Regression
A new learning algorithm for solving piecewise linear regression problems is proposed. It is able to train a proper multilayer feedforward neural network so as to reconstruct a target function assuming a different linear behavior on each set of a polyhedral partition of the input domain. The proposed method combine local estimation, clustering in weight space, classification and regression in o...
متن کاملA new mathematical programming approach in fuzzy linear regression models
In this paper, we introduce a new mathematical programming approach to estimate the parameters of fuzzy linear regression with crisp/fuzzy input and fuzzy output. The advantage of this approach is, both of dependent and independent variables are influenced on the objective function. Therefore, this model rectifies some problems about outliers. Also, in this paper we use possibility function in ...
متن کاملPiecewise Linear Dynamic Programming for Constrained POMDPs
We describe an exact dynamic programming update for constrained partially observable Markov decision processes (CPOMDPs). State-of-the-art exact solution of unconstrained POMDPs relies on implicit enumeration of the vectors in the piecewise linear value function, and pruning operations to obtain a minimal representation of the updated value function. In dynamic programming for CPOMDPs, each vec...
متن کاملA New Class of Piecewise-linear Approximation Methods for Mathematical Programming
We propose a new approach for solving general constrained nonlinear maximization problems with concave objective functions. Neither the objective functions need to be differentiable nor the constraints need to be linear, convex, differentiable or separable. Stochastic programming problems have been shown to have deterministic nonlinear equivalents. The methods proposed are particularly useful f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Expert Systems with Applications
سال: 2016
ISSN: 0957-4174
DOI: 10.1016/j.eswa.2015.08.034